Enhancing Algebraic Query Relaxation with Semantic Similarity
نویسنده
چکیده
Cooperative database systems support a database user by searching for answers that are closely related to his query and hence are informative answers. Common operators to relax the user query are Dropping Condition, Anti-Instantiation and Goal Replacement. In this article, we provide an algebraic version of these operators. Moreover we propose some heuristics to assign a degree of similarity to each tuple of an answer table; this degree can help the user to determine whether this answer is relevant for him or not.
منابع مشابه
Endowing Semantic Query Languages with Advanced Relaxation Capabilities
The problem of relaxing Semantic Web Database (SWDB) queries that return an empty/unsatisfactory set of answers, has been addressed by several works in the last years. Most of these studies have focused on developing new relaxation techniques or on optimizing the top-k query processing. However, only few works have been conducted to provide a fine and declarative control of query relaxation to ...
متن کاملQuery expansion based on relevance feedback and latent semantic analysis
Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...
متن کاملAnswering Imprecise Queries over Autonomous Databases
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest metrics that are hard to elicit from lay users. Moreover they assume the ability to modify the architecture of the underlying database. Given that most Web databases are autonomous and may have users with limited expertise over the asso...
متن کاملSemantic Proximity Between Queries and the Empty Answer Problem
This paper proposes an approach aimed at obviating empty answers for a family of conjunctive queries involving Boolean or fuzzy value constraints. Contrary to the approaches based on a relaxation of the predicates involved in the query, the principle suggested here consists in replacing the query by another one similar which has been processed previously and whose answer is known to be non-empt...
متن کاملREGIMvid at ImageCLEF2012: Concept-based Query Refinement and Relevance-based Ranking Enhancement for Image Retrieval
In this paper, we present our proposed approach that deals with two important steps in the retrieval process, which are query analysis and relevance-based ranking. First, query analysis takes into account two forms of queries: textual and visual which present the form of queries provided by ImageCLEF in the task “Visual concept detection, annotation, and retrieval using Flickr photos ”. The mai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1210.6242 شماره
صفحات -
تاریخ انتشار 2012